Fixing improper colorings of graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixing improper colorings of graphs

In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper r-coloring φ of a graph G. We investigate the problem of finding a proper r-coloring of G, which is “the most similar” to φ, i.e. the number k of vertices that have to be recolored is minimum possible. We observe that the problem is NP-complete for any r ≥ 3, even for bipartite pl...

متن کامل

Acrylic improper colorings of graphs

In this paper, we introduce the new notion of acyclic improper colorings of graphs. An improper coloring of a graph is a vertex-coloring in which adjacent vertices are allowed to have the same color, but each color class V i satisses some condition depending on i. Such a coloring is acyclic if there are no alternating 2-colored cycles. We prove that every outerplanar graph can be acyclically 2-...

متن کامل

Acyclic Improper Colorings of Graphs

In this paper, we introduce the new notion of acyclic improper colorings of graphs. An improper coloring of a graph G is a mapping c from the set of vertices of G to a set of colors such that for every color i, the subgraph induced by the vertices with color i satisses some property depending on i. Such an improper coloring is acyclic if for every two distinct colors i and j, the subgraph induc...

متن کامل

Perfect $2$-colorings of the Platonic graphs

In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and  the icosahedral graph.

متن کامل

Negative results on acyclic improper colorings

Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number k is at most k2. We prove that this bound is tight for k ≥ 3. We also consider acyclic improper colorings on planar graphs and partial ktrees. Finally, we show that some improper and/or acyclic colorings are NP-complete on restricted subclasses of planar graphs, in particular acyclic 3-colorabi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2018

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2017.11.013